New Convergence Results for Least Squares Identification Algorithm, Report no. LiTH-ISY-R-2904
نویسندگان
چکیده
The basic least squares method for identifying linear systems has been extensively studied. Conditions for convergence involve issues about noise assumptions and behavior of the sample covariance matrix of the regressors. Lai and Wei proved in 1982 convergence for essentially minimal conditions on the regression matrix: All eigenvalues must tend to in nity, and the logarithm of the largest eigenvalue must not tend to in nity faster than the smallest eigenvalue. In this contribution we revisit this classical result with respect to assumptions on the noise: How much unstructured disturbances can be allowed without a ecting the convergence? The answer is that the norm of these disturbances must tend to in nity slower than the smallest eigenvalue of the regression matrix.
منابع مشابه
Time-Varying Parameter Estimation under Stochastic Perturbations Using LSM, Report no. LiTH-ISY-R-3019
In this paper, we deal with the problem of continuous-time timevarying parameter estimation in stochastic systems, under 3 different kinds of stochastic perturbations: additive and multiplicative white noise, and colored noise. The proposed algorithm is based on the Least Squares Method with forgetting factor. Some numerical examples illustrate the effectiveness of the proposed algorithm. An an...
متن کاملMaximum Likelihood Estimation of Gaussian Models with Missing Data—Eight Equivalent Formulations, Report no. LiTH-ISY-R-3013
In this paper we derive the maximum likelihood problem for missing data from a Gaussian model. We present in total eight di erent equivalent formulations of the resulting optimization problem, four out of which are nonlinear least squares formulations. Among these formulations are also formulations based on the expectation-maximization algorithm. Expressions for the derivatives needed in order ...
متن کاملOptimality analysis of the Two-Stage Algorithm for Hammerstein system identification , Report no. LiTH-ISY-R-2909
The Two-Stage Algorithm (TSA) has been extensively used and adapted for the identi cation of Hammerstein systems. It essentially deals with the parameter estimation problem for a linear regression parameterized in a bilinear form. This paper is motivated by a somewhat contradictory fact: though the optimality of the TSA has been established only in the case of some special weighting matrices, t...
متن کاملLocal Identifiability and Observability of Nonlinear Differential-Algebraic Equations, Report no. LiTH-ISY-R-2711
Identifiability is important to guarantee convergence in system identification applications, and observability is important in applications such as control and diagnosis. In this paper, recent results on analysis of nonlinear differentialalgebraic equations are used to derive criteria for local identifiability and local weak observability for such models. The criteria are based on rank tests. E...
متن کاملSegmentation of ARX-models Using Sum-of-Norms Regularization, Report no. LiTH-ISY-R-2941
Segmentation of time-varying systems and signals into models whose parameters are piecewise constant in time is an important and well studied problem. It is here formulated as a least-squares problem with sum-ofnorms regularization over the state parameter jumps, a generalization of `1-regularization. A nice property of the suggested formulation is that it only has one tuning parameter, the reg...
متن کامل